On a coloring conjecture about unit fractions
نویسندگان
چکیده
We prove an old conjecture of Erdős and Graham on sums of unit fractions: There exists a constant b > 0 such that if we r-color the integers in [2, br ], then there exists a monochromatic set S such that ∑ n∈S 1/n = 1.
منابع مشابه
-λ coloring of graphs and Conjecture Δ ^ 2
For a given graph G, the square of G, denoted by G2, is a graph with the vertex set V(G) such that two vertices are adjacent if and only if the distance of these vertices in G is at most two. A graph G is called squared if there exists some graph H such that G= H2. A function f:V(G) {0,1,2…, k} is called a coloring of G if for every pair of vertices x,yV(G) with d(x,y)=1 we have |f(x)-f(y)|2 an...
متن کاملThe Overfull Conjecture and the Conformability Conjecture
In this paper we show that under some fairly general conditions the Overfull Conjecture about the chromatic index of a graph G implies the Conformability Conjecture about the total chromatic number of G. We also show that if G has even order and high maximum degree, then G is conformable unless the de0ciency is very small. c © 2001 Elsevier Science B.V. All rights reserved.
متن کاملApproximation algorithms for finding and partitioning unit-disk graphs into co-k-plexes
This article studies a degree-bounded generalization of independent sets called co-k-plexes. Constant factor approximation algorithms are developed for the maximum co-k-plex problem on unit-disk graphs. The related problem of minimum co-k-plex coloring that generalizes classical vertex coloring is also studied in the context of unit-disk graphs. We extend several classical approximation results...
متن کاملA note on partial list coloring
Let G be a simple graph with n vertices and list chromatic number χl(G) = χl. Suppose that 0 ≤ t ≤ χl and each vertex of G is assigned a list of t colors. Albertson, Grossman and Haas [1] conjectured that at least tn χl vertices of G can be colored from these lists. In this paper we find some new results in partial list coloring which help us to show that the conjecture is true for at least hal...
متن کاملProof of the List Edge Coloring Conjecture for Complete Graphs of Prime Degree
We prove that the list-chromatic index and paintability index of Kp+1 is p, for all odd primes p. This implies that the List Edge Coloring Conjecture holds for complete graphs with less than 10 vertices. It also shows that there exist arbitrarily big complete graphs for which the conjecture holds, even among the complete graphs of class 1. Our proof combines the Quantitative Combinatorial Nulls...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003